An Efficient Batch Verifying Scheme for Detecting Illegal Signatures

In a batch verifying scheme, multiple RSA digital signatures can be verified simultaneously in just one exponential operation time. Currently, the verifier could not easily detect where the signature-verification fault was located in most schemes, if the batch verification fails. In this article, we proposed a new batch verifying multiple RSA digital signatures scheme based on a cube. The scheme can detect accurately where the signature-verification fault is located. Moreover, once the total number of signatures is fixed, the size of exponentiation operations is independent from the number of illegal signatures in our scheme. Therefore, our scheme has a better performance and higher efficiency than the previous ones. Finally, we described an extend batch verifying scheme under the condition of n-dimension.